Diagnosability of regular systems
نویسندگان
چکیده
A novel approach aimed at evaluating the diagnosability of regular systems under the PMC model is introduced. The diagnosability is defined as the ability to provide a correct diagnosis, although possibly incomplete. This concept is somehow intermediate between one-step diagnosability and sequential diagnosability. A lower bound to diagnosability is determined by lower bounding the minimum of a ”syndrome-dependent” bound t over the set of all the admissible syndromes. In turn, t is determined by evaluating the cardinality of the smallest consistent fault set containing an aggregate of maximum cardinality. The new approach, which applies to any regular system, relies on the ”edge-isoperimetric inequalities” of connected components of units declaring each other non-faulty. This approach has been used to derive tight lower bounds to the diagnosability of toroidal grids and hypercubes, which improve the existing bounds for the same structures.
منابع مشابه
On conditional diagnosability of the folded hypercubes
The n-dimensional folded hypercube FQn, a variation of the hypercube proposed by Ahmed et al. [A. El-Amawy, S. Latifi, Properties and performance of folded hypercubes, IEEE Transactions on Parallel and Distributed Systems 2(3) (1991) 31–42], is an (n + 1)-regular (n + 1)-connected graph. Conditional diagnosability, a new measure of diagnosability introduced by Lai et al. [Pao-Lien Lai, Jimmy J....
متن کاملPredictability in Discrete-event Systems under Partial Observation
This paper studies the problem of predicting occurrences of a significant event in a discrete-event system. The predictability of occurrences of an event in a system is defined in the context of formal languages. The predictability of a language is a stronger condition than the diagnosability of the language. An implementable necessary and sufficient condition for predictability of occurrences ...
متن کاملDiagnosability in concurrent probabilistic systems
Diagnosability is a key attribute of systems to enable the detection of failure events by partial observations. This paper addresses the diagnosability in concurrent probabilistic systems. Four different notions (L-, P-, A-, and AA-diagnosability) are characterised by formulas of a logic of knowledge, time and probability. Also, we investigate the computational complexities of verifying them: t...
متن کاملThe Relationship between Connectivity and Diagnosability on Regular Networks
The node connectivity is usually used to measure the fault tolerance of a multiprocessor system. On the other hand, the diagnosability is an important ability to provide a system level self-diagnosis for maintaining the reliability of a multiprocessor system. It is interesting to investigate the relationship between the connectivity and the diagnosability. Two diagnosis models: PMC model and co...
متن کاملA Model-Based Framework for Stochastic Diagnosability
We propose a model-based framework to provide a clear semantics and well-developed algorithms for assessing the diagnosability of stochastic systems. This framework applies techniques originally developed for modelbased diagnosis. Our framework enables us to (1) assess the diagnosability of a system, (2) analyze which faults are diagnosable, (3) identify sensor suites necessary for achieving pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 45 شماره
صفحات -
تاریخ انتشار 2002